A simple axiomatic basis for programming language constructs
نویسندگان
چکیده
منابع مشابه
Generic Compilation Schemes for Simple Programming Constructs Generic Compilation Schemes for Simple Programming Constructs
states MState are equal global and local program pointer refer to the same instruction and abstract and concrete stacks correspondand concrete stacks correspond Correspondence on the stacks is speci ed by the predicate Generic Compilation Schemes for Simple Programming Constructs eq stack mp s s RECURSIVE bool depth s depth s AND not empty s IMPLIES not empty s AND LET mc pc top s IN startadr t...
متن کاملLanguage Constructs for Multi-agent Programming
In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend programming languages based on the BDI style of logical agent model with two such constructs, namely constraints and content/context sets. These two aspects provide sufficient expressive power to allow us to represent, simply an...
متن کاملLanguage Constructs for Distributed Real-Time Programming
For many distributed applications, it is not sufficient for programs to be logically correct. In addition, they must satisfy various timing constraints. This paper discusses primitives that support the construction of distributed real-time programs. Our discussion is focused in two areas: timing specification and communication. To allow the specifications of timing constraints, we introduce the...
متن کاملLanguage Constructs for Programming Active Databases
This paper presents database programming language constructs that. can be used to realize a variety of different semantics for rule application in active database syst.ems. The primary novel feature introduced is the “delayed update”, or delta, which is a first-class value representing a set of proposed modifications to the underlying persistent store. Deltas can be created, inspected, and comb...
متن کاملMechanized Semantics of Simple Imperative Programming Constructs
In this paper a uniform formalization in PVS of various kinds of semantics of imper ative programming language constructs is presented Based on a comprehensive de velopment of xed point theory the denotational semantics of elementary constructs of imperative programming languages are de ned as state transformers These state transformers induce corresponding predicate transformers providing a me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae (Proceedings)
سال: 1974
ISSN: 1385-7258
DOI: 10.1016/1385-7258(74)90008-0